Practical Anonymity for the Masses with Mix-Networks
نویسندگان
چکیده
Designing mix-networks for low-latency applications that offer acceptable performance and provide good resistance against attacks without introducing too much overhead is very difficult. Good performance and small overheads are vital to attract users and to be able to support many of them, because with only a few users, there is no anonymity at all. In this paper, we analyze how well different kinds of mix-networks are suited to provide practical anonymity for a very large number of users.
منابع مشابه
Practical Anonymity for the Masses with MorphMix
MorphMix is a peer-to-peer circuit-based mix network to provide practical anonymous low-latency Internet access for millions of users. The basic ideas of MorphMix have been published before; this paper focuses on solving open problems and giving an analysis of the resistance to attacks and the performance it offers assuming realistic scenarios with very many users. We demonstrate that MorphMix ...
متن کاملTowards practical and fundamental limits of anonymity protection
A common function of anonymity systems is the embedding of subjects that are associated to some attributes in a set of subjects, the anonymity set. Every subject within the anonymity set appears to be possibly associated to attributes of every other subject within it. The anonymity set covers the associations between the subjects and their attributes. The limit of anonymity protection basically...
متن کاملThe Traffic Analysis of Continuous-Time Mixes
We apply the information-theoretic anonymity metrics to continuous-time mixes, that individually delay messages instead of batching them. The anonymity of such mixes is measured based on their delay characteristics, and as an example the exponential mix (sg-mix) is analysed, simulated and shown to use the optimal strategy. We also describe a practical and powerful traffic analysis attack agains...
متن کاملAn Indistinguishability-Based Characterization of Anonymous Channels
We revisit the problem of anonymous communication, in which users wish to send messages to each other without revealing their identities. We propose a novel framework to organize and compare anonymity definitions. In this framework, we present simple and practical definitions for anonymous channels in the context of computational indistinguishability. The notions seem to capture the intuitive p...
متن کاملMix-Networks with Restricted Routes
We present a mix network topology that is based on sparse expander graphs, with each mix only communicating with a few neighbouring others. We analyse the anonymity such networks provide, and compare it with fully connected mix networks and mix cascades. We prove that such a topology is efficient since it only requires the route length of messages to be relatively small in comparison with the n...
متن کامل